Iterated realizability as a comma construction
نویسندگان
چکیده
منابع مشابه
Realizability interpretation of PA by iterated limiting PCA
For any partial combinatory algebra (pca for short) A, the class of A-representable partial functions from N to A quotiented by the filter of cofinite sets of N, is a pca such that the representable partial functions are exactly the limiting partial functions of A-representable partial functions (Akama, “Limiting partial combinatory algebras” Theoret. Comput. Sci. Vol. 311 2004). The n-times it...
متن کاملThe white ‘comma’ as a distractive mark on the wings of comma butterflies
0003-3472 2013 The Authors. Published on behalf http://dx.doi.org/10.1016/j.anbehav.2013.10.003 Distractive marks have been suggested to prevent predator detection or recognition of a prey, by drawing the attention away from recognizable traits of the bearer. The white ‘comma’ on the wings of comma butterflies, Polygonia c-album, has been suggested to represent such a distractive mark. In a lab...
متن کاملChinese sentence segmentation as comma classification
We describe a method for disambiguating Chinese commas that is central to Chinese sentence segmentation. Chinese sentence segmentation is viewed as the detection of loosely coordinated clauses separated by commas. Trained and tested on data derived from the Chinese Treebank, our model achieves a classification accuracy of close to 90% overall, which translates to an F1 score of 70% for detectin...
متن کاملRealizability Semantics for Quantified Modal Logic: Generalizing Flagg's 1985 Construction
A semantics for quantified modal logic is presented that is based on Kleene's notion of realizability. This semantics generalizes Flagg's 1985 construction of a model of a modal version of Church's Thesis and first-order arithmetic. While the bulk of the paper is devoted to developing the details of the semantics, to illustrate the scope of this approach, we show that the construction produces ...
متن کاملRealizability of Polytopes as a Low Rank Matrix Completion Problem
This article gives necessary and sufficient conditions for a relation to be the containment relation between the facets and vertices of a polytope. Also given here, are a set of matrices parameterizing the linear moduli space and another set parameterizing the projective moduli space of a combinatorial polytope.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Proceedings of the Cambridge Philosophical Society
سال: 2008
ISSN: 0305-0041,1469-8064
DOI: 10.1017/s0305004107000400